Sequential Convex Overbounding Approximation Method for Bilinear Matrix Inequality Problems
نویسندگان
چکیده
منابع مشابه
A sequential parametric convex approximation method with applications to nonconvex truss topology design problems
We describe a general scheme for solving nonconvex optimization problems, where in each iteration the nonconvex feasible set is approximated by an inner convex approximation. The latter is defined using an upper bound on the nonconvex constraint functions. Under appropriate conditions on this upper bounding convex function, a monotone convergence to a KKT point is established. The scheme is app...
متن کاملRobust truss optimization using the sequential parametric convex approximation method
We study the design of robust truss structures under mechanical equilibrium, displacements and stress constraints. Our main objective is to minimize the total amount of material, for the purpose of finding the most economic structure. A robust design is found by considering load perturbations. The nature of the constraints makes the mathematical program nonconvex. In order to solve this problem...
متن کاملJENSEN’S INEQUALITY FOR GG-CONVEX FUNCTIONS
In this paper, we obtain Jensen’s inequality for GG-convex functions. Also, we get in- equalities alike to Hermite-Hadamard inequality for GG-convex functions. Some examples are given.
متن کاملAn extragradient-like approximation method for variational inequality problems and fixed point problems
The purpose of this paper is to investigate the problem of finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of a variational inequality problem for a monotone, Lipschitz continuous mapping. We introduce an extragradient-like approximation method which is based on so-called extragradient method and viscosity approximation method. We establish...
متن کاملComplexity of Matrix Multiplication and Bilinear Problems
Algebraic complexity theory is the study of computation using algebraic models. One of the main achievements of this field has been the introduction of methods to prove lower bounds on the computational complexity, in algebraic models of computation, of concrete problems. Another major achievement has been the development of powerful techniques to construct fast algorithms for computational pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2018
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2018.11.089